Column-Store: Decision Tree Classification of Unseen Attribute Set
نویسندگان
چکیده
منابع مشابه
Column-store: Decision Tree Classification of Unseen Attribute Set
A decision tree can be used for clustering of frequently used attributes to improve tuple reconstruction time in column-stores databases. Due to ad-hoc nature of queries, strongly correlative attributes are grouped together using a decision tree to share a common minimum support probability distribution. At the same time in order to predict the cluster for unseen attribute set, the decision tre...
متن کاملPredicting Twist Condition by Bayesian Classification and Decision Tree Techniques
Railway infrastructures are among the most important national assets of countries. Most of the annual budget of infrastructure managers are spent on repairing, improving and maintaining railways. The best repair method should consider all economic and technical aspects of the problem. In recent years, data analysis of maintenance records has contributed significantly for minimizing the costs. B...
متن کاملAttribute Selection Measure in Decision Tree Growing
Laviniu Aurelian Badulescu University of Craiova, Faculty of Automation, Computers and Electronics, Software Engineering Department Abstract: One of the major tasks in Data Mining is classification. The growing of Decision Tree from data is a very efficient technique for learning classifiers. The selection of an attribute used to split the data set at each Decision Tree node is ...
متن کاملBayesian Spam Filtering Mechanism Based on Decision Tree of Attribute Set Dependence in the MapReduce Framework
Bayesian spam filtering is a classification method based on the theory of probability and statistics, and the Bayesian spam filtering based on Mapreduce can solve the defect of the traditional Bayesian spam filtering that consumes large amounts of system resources and network resources when the mail set is pre-training. It needs to classify mails manually in the pre-training phase of mail set, ...
متن کاملHorizontal representation of a hesitant fuzzy set and its application to multiple attribute decision making
The main aim of this paper is to present a novel method for ranking hesitant fuzzy sets (HFSs) based on transforming HFSs into fuzzy sets (FSs). The idea behind the method is an interesting HFS decomposition which is referred here to as the horizontal representation in the current study. To show the validity of the proposed ranking method, we apply it to solve a multi-attribute decision-making ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Database Management Systems
سال: 2013
ISSN: 0975-5985,0975-5705
DOI: 10.5121/ijdms.2013.5603